The Parallel One-way Hash Function Based on Chebyshev-Halley Methods with Variable Parameter
نویسندگان
چکیده
منابع مشابه
One-way Hash Function Based on Neural Network
A hash function is constructed based on a three-layer neural network. The three neuron-layers are used to realize data confusion, diffusion and compression respectively, and the multi-block hash mode is presented to support the plaintext with variable length. Theoretical analysis and experimental results show that this hash function is one-way, with high key sensitivity and plaintext sensitivit...
متن کاملOne-Way Hash Function based on Cascade Chaos
This paper proposes a novel hash function construction based on cascade chaos. Firstly, the L-length original message is divided into a number of blocks according to every character, which are transformed into corresponding ASCII values. Then the ASCII values are normalized into the interval of (0, 1), which compose a big array with the L-length. Regarding the first normalized ASCII value with ...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملConvertible multi-authenticated encryption scheme with one-way hash function
To send the message to the recipient securely, authenticated encryption schemes were proposed. In 2008, Wu et al. [T.S. Wu, C.L. Hsu, K.Y. Tsai, H.Y. Lin, T.C. Wu, Convertible multi-authenticated encryption scheme, Information Sciences 178 (1) 256–263.] first proposed a convertible multi-authenticated encryption scheme based on discrete logarithms. However, the author finds that the computation...
متن کاملThe MD2 Hash Function Is Not One-Way
MD2 is an early hash function developed by Ron Rivest for RSA Security, that produces message digests of 128 bits. In this paper, we show that MD2 does not reach the ideal security level of 2. We describe preimage attacks against the underlying compression function, the best of which has complexity of 2. As a result, the full MD2 hash can be attacked in preimage with complexity of 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL
سال: 2014
ISSN: 1841-9844,1841-9836
DOI: 10.15837/ijccc.2014.1.867